On the Hamming Distance between base-n representations of whole numbers
نویسنده
چکیده
We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming distances between pairs of consecutive integers from 1 to m, which we will derive. We also state and prove other interesting results concerning the aforementioned topic.
منابع مشابه
Multi-base Representations of Integers: Asymptotic Enumeration and Central Limit Theorems
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties for fast arithmetic. It is usually redundant, which means that each integer can have multiple different digit expansions, so the natural question for the numbe...
متن کاملOn the Number of Multi-base Representations of an Integer
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system is usually redundant, which means that each integer can have multiple different digit expansions. We provide a general asymptotic formula for the number of such multi-base representati...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملOn the binary expansion of the odd Catalan numbers
Let cn = 1 n + 1 ( 2n n ) be the nth Catalan number. In this paper, we look at some of the arithmetic properties of cn. For example, we show that w2(cn) ! log log n for all n ! 3 provided that cn is odd, where w2(m) is the Hamming weight (or the binary sum of digits) of the positive integer m. We also determine all instances in which cn is a base 2 palindrome, and prove that the first k odd Cat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1203.4547 شماره
صفحات -
تاریخ انتشار 2012